LATIN 2006 (theoretical informatics)Correa, José R; Hevia, Alejandro; Kiwi, Marcos et al.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32755-X, 1Vol, XVI-814 p, isbn 3-540-32755-XConference Proceedings

Latin American Theoretical Informatics Conference (LATIN)CORREA, José R; KIWI, Marcos.Algorithmica. 2008, Vol 50, Num 4, issn 0178-4617, 182 p.Conference Proceedings

Bin packing with controllable item sizesCORREA, José R; EPSTEIN, Leah.Information and computation (Print). 2008, Vol 206, Num 8, pp 1003-1016, issn 0890-5401, 14 p.Article

Algorithmic challenges in web search enginesBAEZA-YATES, Ricardo.Lecture notes in computer science. 2006, pp 1-7, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 7 p.Conference Paper

C-varieties, actions and wreath productCHAUBARD, Laura.Lecture notes in computer science. 2006, pp 274-285, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

The branch-width of circular-arc graphsMAZOIT, Frédéric.Lecture notes in computer science. 2006, pp 727-736, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 10 p.Conference Paper

Modelling errors and recovery for communicationSUDAN, Madhu.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-32755-X, 1Vol, p. 25Conference Paper

A faster algorithm for finding maximum independent sets in sparse graphsFURER, Martin.Lecture notes in computer science. 2006, pp 491-501, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 11 p.Conference Paper

A 4-approximation algorithm for guarding 1.5-dimensional terrainsKING, James.Lecture notes in computer science. 2006, pp 629-640, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Efficient approximate dictionary look-up for long words over small alphabetsARSLAN, Abdullah N.Lecture notes in computer science. 2006, pp 118-129, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Exponential lower bounds on the space complexity of OBDD-Based graph algorithmsSAWITZKI, Daniel.Lecture notes in computer science. 2006, pp 781-792, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

RNA molecules : Glimpses through an algorithmic lensCONDON, Anne.Lecture notes in computer science. 2006, pp 8-10, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 3 p.Conference Paper

Finding all minimal infrequent multi-dimensional intervalsELBASSIONI, Khaled M.Lecture notes in computer science. 2006, pp 423-434, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

SquaresHURTADO, Ferran.Lecture notes in computer science. 2006, pp 11-12, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 2 p.Conference Paper

Matching based augmentations for approximating connectivity problemsRAVI, R.Lecture notes in computer science. 2006, pp 13-24, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Improved exponential-time algorithms for treewidth and minimum fill-inVILLANGER, Yngve.Lecture notes in computer science. 2006, pp 800-811, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Lossless data compression via error correctionVERDU, Sergio.Lecture notes in computer science. 2006, pp 26-27, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 2 p.Conference Paper

The power and weakness of randomness in computationWIGDERSON, Avi.Lecture notes in computer science. 2006, pp 28-29, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 2 p.Conference Paper

A fast asymptotic approximation scheme for bin packing with rejectionBEIN, Wolfgang; CORREA, José R; XIN HAN et al.Theoretical computer science. 2008, Vol 393, Num 1-3, pp 14-22, issn 0304-3975, 9 p.Article

LP-based online scheduling : from single to parallel machinesCORREA, José R; WAGNER, Michael R.Mathematical programming (Print). 2009, Vol 119, Num 1, pp 109-136, issn 0025-5610, 28 p.Article

IMPROVED BOUNDS ON NONBLOCKING 3-STAGE CLOS NETWORKSCORREA, José R; GOEMANS, Michel X.SIAM journal on computing (Print). 2008, Vol 37, Num 3, pp 870-894, issn 0097-5397, 25 p.Article

An architecture for provably secure computationAJTAI, Miklos; DWORK, Cynthia; STOCKMEYER, Larry et al.Lecture notes in computer science. 2006, pp 56-67, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

I/O-Efficient algorithms on near-planar graphsHAVERKORT, Herman; TOMA, Laura.Lecture notes in computer science. 2006, pp 580-591, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Stochastic covering and adaptivityGOEMANS, Michel; VONDRAK, Jan.Lecture notes in computer science. 2006, pp 532-543, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper

Two birds with one stone : The best of branchwidth and treewidth with one algorithmDORN, Frederic; TELLE, Jan Arne.Lecture notes in computer science. 2006, pp 386-397, issn 0302-9743, isbn 3-540-32755-X, 1Vol, 12 p.Conference Paper